HSL_MA57 - Sparse symmetric system: multifrontal method
ثبت نشده
چکیده
The method used is a direct method based on a sparse variant of Gaussian elimination and is discussed further by Duff and Reid, ACM Trans. Math. Software 9 (1983), 302-325. A detailed discussion on the MA57 strategy and performance is given by Duff, ACM Trans. Math. Software 30 (2004), 118-144. Relevant work on pivoting and scaling strategies is given by Duff and Pralet, SIAM Journal Matrix Analysis and Applications 27 (2005), 313-340. More recent work on static pivoting is given by Duff and Pralet, SIAM Journal Matrix Analysis and Applications 29 (2007), 1007-1024.
منابع مشابه
NUMERICAL ANALYSIS GROUP PROGRESS REPORT January 1994 – December 1995
2 Sparse Matrices ……………………………………………………………………………… 4 2.1 The direct solution of sparse unsymmetric linear sets of equations (I.S. Duff and J.K. Reid) …………………………………………………………………………… 4 2.2 The design and use of algorithms for permuting large entries to the diagonal 2.6 Element resequencing for use with a multiple front solver (J. A. Scott) ………… 10 2.7 Exploiting zeros on the diagonal in the direct s...
متن کاملUnsymmetric-pattern Multifrontal Methods for Parallel Sparse Lu Factorization
Sparse matrix factorization algorithms are typically characterized by irregular memory access patterns that limit their performance on parallel-vector supercomputers. For symmetric problems, methods such as the multifrontal method replace irregular operations with dense matrix kernels. However, no e cient method based primarily on dense matrix kernels exists for matrices whose pattern is very u...
متن کاملAn Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
Sparse matrix factorization algorithms for general problems are typically characterized by irregular memory access patterns that limit their performance on parallel-vector supercomputers. For symmetric problems, methods such as the multifrontal method avoid indirect addressing in the innermost loops by using dense matrix kernels. However, no efficient LU factorization algorithm based primarily ...
متن کاملEfficient Parallel Solutions of Large Sparse Spd Systems on Distributed-memory Multiprocessors
We consider several issues involved in the solution of sparse symmetric positive deenite systems by multifrontal method on distributed-memory multiprocessors. First, we present a new algorithm for computing the partial factorization of a frontal matrix on a subset of processors which signiicantly improves the performance of a distributed multifrontal algorithm previously designed. Second, new p...
متن کاملRobust and Efficient Multifrontal Solver for Large Discretized PDEs
This paper presents a robust structured multifrontal factorization method for large symmetric positive definite sparse matrices arising from the discretization of partial differential equations (PDEs). For PDEs such as 2D and 3D elliptic equations, the method costs roughly O(n) and O(n4/3) flops, respectively. The algorithm takes advantage of a low-rank property in the direct factorization of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013